A comparative evaluation of medium- and large-scale feature selectors for pattern classifiers

نویسندگان

  • Mineichi Kudo
  • Jack Sklansky
چکیده

Needs of feature selection in medium and large problems increases in many fields including medical and image processing fields. Previous comparative studies of feature selection algorithms are not satisfactory in problem size and in criterion function. In addition, no way has not shown to compare algorithms with different objectives. In this study, we propose a unified way to compare a large variety of algorithms. Our results show that the sequential floating algorithms promises for up to medium problems and genetic algorithms for medium and large problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of algorithms that select features for pattern classifiers

A comparative study of algorithms for large-scale feature selection (where the number of features is over 50) is carried out. In the study, the goodness of a feature subset is measured by leave-one-out correct-classiication rate of a nearest-neighbor (1-NN) classiier and many practical problems are used. A uniied way is given to compare algorithms having dissimilar objectives. Based on results ...

متن کامل

A comparative evaluation of medium - and large - scale featureselectors for pattern classi

Needs of feature selection in medium and large problems (medium-and large-scale feature selection) increases in many elds including medical and image processing elds. Previous comparative studies of feature selection algorithms are not suucient in problem size and in criterion function. In addition, no way has not shown to compare algorithms with diierent objectives. In this study, we propose a...

متن کامل

Improving Supervised Sense Disambiguation with Web-Scale Selectors

This paper introduces a method to improve supervised word sense disambiguation performance by including a new class of features which leverage contextual information from large unannotated corpora. This new feature class, selectors, contains words that appear in other corpora with the same local context as a given lexical instance. We show that support vector sense classifiers trained with sele...

متن کامل

Detection and Classification of Heart Premature Contractions via α-Level Binary Neyman-Pearson Radius Test: A Comparative Study

The aim of this study is to introduce a new methodology for isolation of ectopic rhythms of ambulatory electrocardiogram (ECG) holter data via appropriate statistical analyses imposing reasonable computational burden. First, the events of the ECG signal are detected and delineated using a robust wavelet-based algorithm. Then, using Binary Neyman-Pearson Radius test, an appropriate classifie...

متن کامل

Local gradient pattern - A novel feature representation for facial expression recognition

Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Kybernetika

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1998